Finite Illumination of Unbounded Closed Convex Sets

نویسندگان

  • Mabel A. Rodŕiguez
  • Fausto A. Toranzos
چکیده

If K is an unbounded closed convex subset of Ed having nonempty interior, we seek necessary and/or sufficient conditions to ensure that the boundary of K can be externally illuminated from a finite set of directions. This problem was stated as open in a recent book by Boltyanski. The tools used in this search are those developed by Visibility Theory such as the ideas of star, inner stem, visibility cell, nova and cone of recession. Mathematical Subject Classification: 52A30 52A20

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Functionally closed sets and functionally convex sets in real Banach spaces

‎Let $X$ be a real normed  space, then  $C(subseteq X)$  is  functionally  convex  (briefly, $F$-convex), if  $T(C)subseteq Bbb R $ is  convex for all bounded linear transformations $Tin B(X,R)$; and $K(subseteq X)$  is  functionally   closed (briefly, $F$-closed), if  $T(K)subseteq Bbb R $ is  closed  for all bounded linear transformations $Tin B(X,R)$. We improve the    Krein-Milman theorem  ...

متن کامل

Some results on functionally convex sets in real Banach spaces

‎We use of two notions functionally convex (briefly‎, ‎F--convex) and functionally closed (briefly‎, ‎F--closed) in functional analysis and obtain more results‎. ‎We show that if $lbrace A_{alpha} rbrace _{alpha in I}$ is a family $F$--convex subsets with non empty intersection of a Banach space $X$‎, ‎then $bigcup_{alphain I}A_{alpha}$ is F--convex‎. ‎Moreover‎, ‎we introduce new definition o...

متن کامل

Regularity in mixed-integer convex representability

Characterizations of the sets with mixed integer programming (MIP) formulations using only rational linear inequalities (rational MILP representable) and those with formulations that use arbitrary closed convex constraints (MICP representable) were given by Jeroslow and Lowe (1984), and Lubin, Zadik and Vielma (2017). The latter also showed that even MICP representable subsets of the natural nu...

متن کامل

The Minkowski Theorem for Max-plus Convex Sets

We establish the following max-plus analogue of Minkowski’s theorem. Any point of a compact max-plus convex subset of (R∪{−∞})n can be written as the max-plus convex combination of at most n + 1 of the extreme points of this subset. We establish related results for closed max-plus convex cones and closed unbounded max-plus convex sets. In particular, we show that a closed max-plus convex set ca...

متن کامل

Three Point Arcwise Convexity

Let 5 be a set in a two dimensional Euclidean space E2. Such a set 5 is said to be arcwise convex [5] if each pair of its points can be joined by a convex arc lying in S. A convex arc is, by definition, an arc which is contained in the boundary of a plane convex set. In two previous papers, [5; 6], the author studied certain properties of closed arcwise convex sets. It is the purpose of this pa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006